Revisiting Schurs bound on the largest singular value

نویسنده

  • Vladimir Nikiforov
چکیده

We give upper and lower bounds on the largest singular value of a matrix using analogues to walks in graphs. For nonnegative matrices these bounds are asymptotically tight. In particular, the following result improves a bound due to Schur. If A = (aij) is an m n complex matrix, its largest singular value satis…es 2 (A) max i2[m] P j2[n] jaij j cj max aij 6=0 ricj ; where ri = P k2[n] jaikj ; cj = P k2[m] jakj j : Keywords: largest singular value, Schur’s bound, singular values, walks. AMS classi…cation: 15A42

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Revisiting Schur ’ s bound on the largest singular value Vladimir Nikiforov

We give upper and lower bounds on the largest singular value of a matrix using analogues to walks in graphs. For nonnegative matrices these bounds are asymptotically tight. In particular, the following result improves a bound due to Schur. If A = (aij) is an m× n complex matrix, its largest singular value satisfies σ (A) ≤ max i∈[m] ∑ j∈[n] |aij| cj ≤ max aij 6=0 ricj, where ri = ∑ k∈[n] |aik| ...

متن کامل

A new S-type upper bound for the largest singular value of nonnegative rectangular tensors

By breaking [Formula: see text] into disjoint subsets S and its complement, a new S-type upper bound for the largest singular value of nonnegative rectangular tensors is given and proved to be better than some existing ones. Numerical examples are given to verify the theoretical results.

متن کامل

On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound

The gap between the complex structured singular value of a complex matrix M and its convex upper bound is considered. New necessary and sufficient conditions for the existence of the gap are derived. It is shown that determining whether there exists such a gap is as difficult as evaluating a structured singular value of a reduced rank matrix (whose rank is equal to the multiplicity of the large...

متن کامل

When are synchronization errors small?

We address the question of bounds on the synchronization error for the case of nearly identical nonlinear systems. It is pointed out that negative largest conditional Lyapunov exponents of the synchronization manifold are not sufficient to guarantee a small synchronization error and that one has to find bounds for the deformation of the manifold due to perturbations. We present an analytic boun...

متن کامل

On the optimality and sharpness of Laguerre's lower bound on the smallest eigenvalue of a symmetric positive definite matrix

Lower bounds on the smallest eigenvalue of a symmetric positive definite matrices A ∈ Rm×m play an important role in condition number estimation and in iterative methods for singular value computation. In particular, the bounds based on Tr(A) and Tr(A) attract attention recently because they can be computed in O(m) work when A is tridiagonal. In this paper, we focus on these bounds and investig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007